Efficient VLSI Architecture for Montgomery Modular Multiplier

نویسندگان

  • S. Meenakshi
  • M. Jagadeeswari
چکیده

Montgomery modular multiplication is used in cryptographic algorithms and digital signal processing application. The main objective is to reduce the delay and area of the Montgomery multipliers while maintaining low hardware complexity. To speed up, high-speed Montgomery modular multiplication algorithms and hardware architectures employ carry-save addition to avoid the carry propagation at each addition operation of the add-shift loop but it requires extra clock cycles and it increases hardware complexity. A Configurable CSA (CCSA) is proposed to for performing modular multiplication by using two serial half-adders and a mechanism that can detect and skip the unnecessary carry-save addition operations thereby maintaining the short critical path delay is developed by means of designing a skip detector. Simulation is carried out using Xilinx ISE Design Suite 13.2. The proposed Montgomery modular multiplier can achieve higher performance and high speed when compared conventional modular multipliers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient VLSI Architecture for Montgomery Modular Multiplier

Montgomery modular multiplication is used in cryptographic algorithms and digital signal processing application. The main objective is to reduce the delay and area of the Montgomery multipliers while maintaining low hardware complexity. To speed up, high-speed Montgomery modular multiplication algorithms and hardware architectures employ carry-save addition to avoid the carry propagation at eac...

متن کامل

Scalable and systolic Montgomery multiplier over GF(2m) generated by trinomials

A Montgomery’s algorithm in GF(2) based on the Hankel matrix–vector representation is proposed. The hardware architecture obtained from this algorithm indicates low-complexity bit-parallel systolic multipliers with irreducible trinomials. The results reveal that the proposed multiplier saves approximately 36% of space complexity as compared to an existing systolic Montgomery multiplier for trin...

متن کامل

An efficient VLSI architecture for RSA public-key cryptosystem

In this paper, a new efficient VLSI archtecture to compute RSA public-key cryptosystem is proposed. The modified H-algorithm is applied to fmd the modular exponentiation. By this modified Halgorithm, the modular multiplication steps reduced about 5dl8. For the modular multiplication the L-algorithm (LSB first) is used. In the architecture of the modular multiplication the iteration times are on...

متن کامل

High-Speed Montgomery Modular Multiplication Using High-Radix Systolic Multiplier

A new high-radix systolic multiplier architecture is presented for Montgomery modular multiplication. Using a radix 2, an n-bit modular multiplication only takes about n/w+6 cycles. This leads to a competitive ASIC implementation for RSA and Elliptic Curve Cryptography (ECC).

متن کامل

Parameterized Rsa Architectures

In this paper, new structures that implement the RSA cryptographic algorithm are presented. The core of these architectures is the modular exponential operation based on a modified Montgomery modular multiplier, where the operations of multiplication and modular reduction are carried out in parallel rather than in an interleaved way as in the traditional Montgomery multiplier. The digit approac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017